A Complete Calculus for Max-SAT
نویسندگان
چکیده
Max-SAT is the problem of finding an assignment minimizing the number of unsatisfied clauses of a given CNF formula. We propose a resolution-like calculus for Max-SAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completeness proof we derive an exact algorithm for Max-SAT and a time upper bound.
منابع مشابه
Efficient Solution of Max-sat and Sat via Higher Order Boltzmann Machines
High order Boltzmann machines (HOBM) have been proposed some time ago, but few applications have been reported. SAT is the canonical NP-complete problem. MAX-SAT is a generalization of SAT in sense that its solution provides answers to SAT. In this paper we propose a mapping on the MAX-SAT problem, in the propositional calculus setting, into HOBM combinatorial optimization problem. The approxim...
متن کاملResolution for Max-SAT
Max-SAT is the problem of finding an assignment minimizing the number of unsatisfied clauses in a CNF formula. We propose a resolution-like calculus for Max-SAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completeness proof we derive an exact algorithm for Max-SAT and a time upper bound. We also define a weighted Max-SA...
متن کاملThe Logic Behind Weighted CSP
We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an original exact algorithm for solving Weighted CSP. Finally, we define several derived rules and prove that they enforce the main soft arc consistency defined in the literature when applied to Weighted CSP instances.
متن کاملSolving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We wanted to see how recent progress in the weighted CSP (WCSP) field could compete with other approaches in related fields. One of these fields is propositional logic and the well-known Max-SAT problem. In this paper, we...
متن کاملA Family of Model-Based Diagnosis Algorithms Based on Max-SAT
Max-SAT is an extensively studied optimization problem and variations of Max-SAT (like Partial Max-SAT and Weighted Max-SAT) can be used for computing minimal diagnoses. In this report we (1) describe a family of algorithms for computing minimal diagnoses based on Max-SAT and (2) experimentally evaluate the performance and optimality of these algorithms on a benchmark consisting of 74XXX/ISCAS8...
متن کامل